Faster scaling algorithms for general graph matching problems
نویسندگان
چکیده
منابع مشابه
Faster Scaling Algorithms for Network Problems
This paper presents algorithms for the assignment problem, the transportation problem and the minimum cost flow problem of operations research. The algorithms find a minimum cost solution, but rtm in time close to the best-known bounds for the corresponding problems without costs. For example, the assignment problem (equivalently, minimum cost matching on a bipartite graph) can be solved in O(,...
متن کاملFaster Algorithms for String Matching Problems: Matching the Convolution Bound
In this paper we give a randomized O(n logn)-time algorithm for the string matching with don't cares problem. This improves the Fischer-Paterson bound 10] from 1974 and answers the open problem posed (among others) by Weiner 30] and Galil 11]. Using the same technique, we give an O(n logn)-time algorithm for other problems, including subset matching and tree pattern matching 15, 21, 9, 7, 17] a...
متن کاملFaster Streaming algorithms for graph spanners
Given an undirected graph G = (V,E) on n vertices, m edges, and an integer t ≥ 1, a subgraph (V,ES), ES ⊆ E is called a t-spanner if for any pair of vertices u, v ∈ V , the distance between them in the subgraph is at most t times the actual distance. We present streaming algorithms for computing a t-spanner of essentially optimal size-stretch trade offs for any undirected graph. Our first algor...
متن کاملParameterized Counting Algorithms for General Graph Covering Problems
We examine the general problem of covering graphs by graphs: given a graph G, a collection P of graphs each on at most p vertices, and an integer r, is there a collection C of subgraphs of G, each belonging to P , such that the removal of the graphs in C from G creates a graph none of whose components have more than r vertices? We can also require that the graphs in C be disjoint (forming a “ma...
متن کاملNew algorithms for matching problems
The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the Gale-Shapley algorithm; for one-sided matching, (random) Serial Dictatorship and Probabilistic Serial rule; for school choice, Gale-Shapley and the Boston mec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM (JACM)
سال: 1991
ISSN: 0004-5411,1557-735X
DOI: 10.1145/115234.115366